Recent Progress in Phylogenetic Combinatorics

نویسنده

  • Andreas W. M. Dress
چکیده

of D is an R-tree. (ii) There exists a tree (V, E ) whose vertex set V contains X, and an edge weighting C : E -i R that assigns a positive length C(e) to each edge e in E , such that D is the restriction of X to the shortest-path metric induced on V. (iii) There exists a map w : S(X) -i R>o from the set S(X) of all bi-partitions or splits of X into the set R ~ o of non-negative real numbers such that, given any two splits S = { A , B } and S’ = {A’, B’} in S ( X ) with w(S), w(S’) # 0, at least one of the four intersections A n A‘, B n A’, A n B’, and B n B’ is empty and D(x, y) = CSES(X:zcrV) w(S) holds where S ( X : z-y) denotes the set of splits S = { A , B } E S(X) that separate z and y. (iv) D ( z , y) + D(u, v) 5 max ( D ( z , u) + D(y, v), D ( z , v) + D(y, u)) holds for all X,Y,U,V E X

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recent developments in graph Ramsey theory

Given a graph H, the Ramsey number r(H) is the smallest natural number N such that any two-colouring of the edges of KN contains a monochromatic copy of H. The existence of these numbers has been known since 1930 but their quantitative behaviour is still not well understood. Even so, there has been a great deal of recent progress on the study of Ramsey numbers and their variants, spurred on by ...

متن کامل

The Order Steps of an Analytic Combinatorics

‎Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures‎. ‎This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines‎, ‎including probability theory‎, ‎statistical physics‎, ‎computational biology and information theory‎. ‎With a caref...

متن کامل

Recent Progress in Algebraic Combinatorics

We survey three recent breakthroughs in algebraic combinatorics. The first is the proof by Knutson and Tao, and later Derksen and Weyman, of the saturation conjecture for Littlewood-Richardson coefficients. The second is the proof of the n! and (n + 1)n−1 conjectures by Haiman. The final breakthrough is the determination by Baik, Deift, and Johansson of the limiting behavior of the length of th...

متن کامل

Phylogenetic relationships in Ranunculus species (Ranunculaceae) based on nrDNA ITS and cpDNA trnL-F sequences

The genus Ranunculus L., with a worldwide distribution, is the largest member of the Ranunculaceae. Here, nuclear ribosomal internal transcribed spacer (ITS) sequence data and chloroplast trnLF sequence data were used to analyze phylogenetic relationships among members of the annual and perennial (Group Praemorsa, Group Rhizomatosa, Group Grumosa and Group non-Grumosa) species of Ranunculus...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008